Almost-Everywhere Superiority for Quantum Polynomial Time
نویسندگان
چکیده
منابع مشابه
Almost-Everywhere Superiority for Quantum Polynomial Time
Simon [Sim97] as extended by Brassard and Høyer [BH97] shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine infinitely often. The present paper shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine almost everywhere.
متن کاملAlmost-Everywhere Superiority for Quantum Polynomial-Time Languages
We prove that, relative to some black box, there are languages for which polynomialtime quantum machines are exponentially faster than each classical machine almost everywhere.
متن کاملAlmost-Everywhere Superiority for Quantum Computing
Simon [Sim97] as extended by Brassard and Høyer [BH97] shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine infinitely often. The present paper shows that there are tasks on which polynomial-time quantum machines are exponentially faster than each classical machine almost everywhere.
متن کاملAlmost-Everywhere Complexity Hierarchies for Nondeterministic Time
A preliminary version of this work appeared as [2]. y Supported in part by National Science Foundation grant CCR-9000045. Some of this research was performed while the author was a visiting professor at Institut f ur Informatik, Universit at W urzburg, D-8700 W urzburg, Federal Republic of Germany. z Supported in part by the National Science Foundation grants CCR-8808949 and CCR-8958528. Wo...
متن کاملIncentive Compatibility: Everywhere vs. Almost Everywhere∗
A risk neutral buyer observes a private signal s ∈ [a, b], which informs her that the mean and variance of a normally distributed risky asset are s and σ s respectively. She then sets a price at which to acquire the asset owned by risk averse “outsiders”. Assume σ s ∈ { 0, σ } for some σ > 0 and let B = { s ∈ [a, b] | σ s = 0 } . If B = ∅, then there exists a fully revealing equilibrium in whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2002
ISSN: 0890-5401
DOI: 10.1006/inco.2001.3110